Generalized Feasibility Analysis on Uniform Multiprocessors
نویسنده
چکیده
This paper presents feasibility tests for scheduling instances of real-time jobs on uniform multiprocessor platforms. In a uniform multiprocessor, each processor has an associated speed – a job executing on a processor of speed s for t time units performs s × t units of work. Two feasibility tests are presented. First, a sufficient condition is presented – whenever this condition holds the jobs are known to be feasible on the multiprocessor. Then, a necessary condition is presented – whenever the jobs are feasible on the multiprocessor, this condition must hold.
منابع مشابه
Characteristics of EDF Schedulability on Uniform Multiprocessors
In uniform multiprocessor platforms, the various processors comprising the multiprocessor platform may have different computing capacities. The focus of this paper is the design of efficient tests for determining whether the Earliest Deadline First Scheduling Algorithm (EDF) can successfully schedule a given real-time task system to meet all deadlines upon a specified uniform multiprocessor pla...
متن کاملTask assignment in heterogeneous multiprocessor platforms ∗
In the partitioned approach to scheduling periodic tasks upon multiprocessors, each task is assigned to a specific processor and all jobs generated by a task are required to execute upon the processor to which the task is assigned. In this paper, the partitioning of periodic task systems upon uniform multiprocessors – multiprocessor platforms in which different processors have different computi...
متن کاملRestricting EDF migration on uniform multiprocessors
Restricted migration of periodic and sporadic tasks on uniform multiprocessors is considered. On multiprocessors, job migration can cause a prohibitively high overhead — particularly in real-time systems where accurate timing is essential. However, if periodic tasks do not maintain state between separate invocations, different jobs of the same task may be allowed to execute on different process...
متن کاملTowards Compositional Hierarchical Scheduling Frameworks on Uniform Multiprocessors
In this report, we approach the problem of defining and analysing compositional hierarchical scheduling frameworks (HSF) upon uniform multiprocessor platforms. For this we propose the uniform multiprocessor periodic resource (UMPR) model for a component interface. We extend previous results (for dedicated uniform multiprocessors, and for compositional HSFs on identical multiprocessors), providi...
متن کاملRobustness results concerning EDF scheduling upon uniform multiprocessors
Each processor in a uniform multiprocessor machine is characterized by a speed or computing capacity, with the interpretation that a job executing on a processor with speed s for t time units completes ðs tÞ units of execution. The earliestdeadline-first (EDF) scheduling of hard-real-time systems upon uniform multiprocessor machines is considered. It is known that online algorithms tend to perf...
متن کامل